Polynomial Smooth Twin Support Vector Machines

Smoothing functions can transform the unsmooth twin support vector machines (TWSVM) into smooth ones, and thus better classification results can be obtained. It has been one of the key problems to seek a better smoothing function in this field for a long time. In this paper, a novel version for smooth TWSVM, termed polynomial smooth twin support vector machines (PSTWSVM), is proposed. In PSTWSVM, using the series expansion, a new class of polynomial smoothing is proposed, and then their important properties are discussed. It is shown that the approximation accuracy and smoothness rank of polynomial functions can be as high as required. Subsequently, the polynomial functions are adopted to convert the original constrained quadratic programming problems of TWSVM into unconstrained minimization problems, and then are solved by the well-known Newton-Armijo algorithm. The effectiveness of the proposed method is demonstrated via experiments on synthetic and real-word benchmark datasets.